Coprime Interleavers Revisited
نویسندگان
چکیده
We investigate good coprime interleavers that perform well in turbo codes and allow for memory-efficient implementation. We first evaluate the spread and the randomness properties of these interleavers using the cycle correlation sum (CCS) and the variance of the second order spread spectrum (VSSS) criteria, respectively. A critical parameter cpower is introduced for interleavers whose lengths are power of 2. It is found that a large cpower typically associates with a small CCS value, indicating a good minimum spread of the coprime interleaver, but the degree of randomness decreases with growing cpower . We next develop rules on choosing good parameters that strike a good balance between minimum spread and degree of randomness. Simulation results confirm that the coprime interleavers designed from our rules perform as well as or better than S-random interleavers.
منابع مشابه
On Generalized Coprime Graphs
Paul Erdos defined the concept of coprime graph and studied about cycles in coprime graphs. In this paper this concept is generalized and a new graph called Generalized coprime graph is introduced. Having observed certain basic properties of the new graph it is proved that the chromatic number and the clique number of some generalized coprime graphs are equal.
متن کاملA Theory of Interleavers
An interleaver is a hardware device commonly used in conjunction with error correcting codes to counteract the e ect of burst errors Interleavers are in widespread use and much is known about them from an engineering standpoint In this paper we propose a mathematical model that provides a rigorous foundation for the theoretical study of interleavers The model captures precisely such no tions as...
متن کاملCyclically Shifted Multiple Interleavers
We propose a simple strategy to generate multiple interleavers. As suggested in literature, using user-distinct interleavers is an effective means to separate multiple users, if applied in addition to user-specific spreading codes in code division multiple access (CDMA). In this paper we particularly focus on interleave division multiple access (IDMA), which has a close relation to CDMA, but us...
متن کاملImproved Method for Searching of Interleavers Using Garello's Method
In this paper an improved method for searching good interleavers from a certain set is proposed. The first few terms, corresponding to maximum distance of approximately 40 of the distance spectra, for turbo codes using these interleavers are determined by means of Garello’s method. The method is applied to find quadratic permutation polynomials (QPP) based interleavers. Compared to previous met...
متن کاملCorrelation Based Analysis of Master Random Interleaver and Tree Based Interleaver
In this paper we consider the design of practical interleavers for interleaver division multiple access (IDMA) systems. A set of interleavers is considered to be practical if it satisfies two criteria one it is easy to generate (i.e., the transmitter and receiver need not store or communicate many bits in order to agree upon an interleaver), and second no two interleavers in the set “collide”. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006